Contingent weighting in judgment and choice.

Preference can be inferred from direct choice between options or from a matching procedure in which the decision maker adjusts one option to match another. Studies of preferences between two-dimensional options (e.g., public policies, job applicants, benefit plans) show that the more prominent dimension looms larger in choice than in matching. Thus, choice is more lexicographic than matching. This finding is viewed as an instance of a general principle of compatibility: The weighting of inputs is enhanced by their compatibility with the output. To account for such effects, we develop a hierarchy of models in which the trade-off between attributes is contingent on the nature of the response. The simplest theory of this type, called the contingent weighting model, is applied to the analysis of various compatibility effects, including the choice-matching discrepancy and the preference-reversal phenomenon. These results raise both conceptual and practical questions concerning the nature, the meaning and the assessment of preference. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

The effect of precursory cooling on rewetting of a slab

The Dua and Tien (1976) model for the rewetting of a slab with precursory cooling is solved exactly by separation of variables. The solution for the rewetting velocity is found to agree very well with a Wiener Hopf technique solution to this model by the author. Rewetting rates predicted by the approximate solution of Dua and Tien are found to agree with the present solution for small Peclet numbers, while underpredicting them for large Peclet numbers. Theoretical quench front velocities compare favorably with experimental data for copper quenched by liquid nitrogen. Precursory cooling is shown to be able to greatly increase the rewetting velocity, in particular for cases of high flow rates, while neglecting it in modelling may result in much too low quench velocities, as compared to experimental measurements.     

Asymptotic and finite element approximations for heat transfer in rotating compressible flow over an infinite porous disk

The laminar boundary layer equations for the compressible flow due to the finite difference in rotation and temperature rates are solved for the case of uniform suction through the disk. The effects of viscous dissipation on the incompressible flow are taken into account for any rotation rate, whereas for a compressible fluid they are considered only for a disk rotating in a stationary fluid. For the general case, the governing equations are solved numerically using a standard finite element scheme. Series solutions are developed for those cases where the suction effect is dominant. Based on the above analytical and numerical solutions, a new asymptotic finite element scheme is presented. By using this scheme one can significantly improve the pointwise accuracy of the standard finite element scheme.     

XFEM‐based crack detection scheme using a genetic algorithm

A new computational tool is developed for the accurate detection and identification of cracks in structures, to be used in conjunction with non‐destructive testing of specimens. It is based on the solution of an inverse problem. Based on some measurements, typically along part of the boundary of the structure, that describe the response of the structure to vibration in a chosen frequency or a combination of frequencies, the goal is to estimate whether the structure contains a crack, and if so, to find the parameters (location, size, orientation and shape) of the crack that produces a response closest to the given measurement data in some chosen norm. The inverse problem is solved using a genetic algorithm (GA). The GA optimization process requires the solution of a very large amount of forward problems. The latter are solved via the extended finite element method (XFEM). This enables one to employ the same regular mesh for all the forward problems. Performance of the method is demonstrated via a number of numerical examples involving a cracked flat membrane. Various computational aspects of the method are discussed, including the a priori estimation of the ill‐posedness of the crack identification problem. Copyright © 2007 John Wiley & Sons, Ltd.     

Vicissitudes of the impetus for growth and change among emerging adults.

The aim of this study was to understand why some emerging adults pursue their goals in effective ways while others become involved in projects or set goals that collapse after a period of time. In order to examine the inner processes which may explain this phenomenon, in-depth interviews were conducted with 70 emerging adults aged 21 to 26. The interviews revealed two main modes in the pursuit of goals among emerging adults. In the "doing-oriented" mode, individuals were extensively invested in a constant pursuit for its own sake, hardly thinking about what they do, and why. In contrast, in the "reflective-oriented" mode, emerging adults were highly reflective about their behaviors, motivations, and future projected plans. Integrating developmental and psychoanalytic thinking, our data propose new understandings of the inner processes through which emerging adults may experience and direct their lives. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

How to Implement a Safe Real-Time System:The OBSERV Implementation of the Production Cell Case Study

The Production Cell example was chosen by FZI (the Computer Science Research Center), in Karlsruhe. to examine the benefits of formal methods for industrial applications. This example was implemented in more than 30 formalisms. This paper describes the implementation of the Production Cell in OBSERV. The OBSERV methodology for software development is based on rapid construction of an executable specification, or prototype, of a system, which may be examined and modified repeatedly to achieve the desired functionality. The objectives of OBSERV also include facilitating a smooth transition to a target system, and providing means for reusing specification, design, and code of systems, particularly real-time reactive systems. In this paper we show how the methods used in the OBSERV implementation address the requirements imposed by reactive systems. We describe the OBSERV implementation of the Production cell, explain design decisions, with special emphasis on reusability and safety issues. We demonstrate how to take care of safety and liveness properties required for this example. These properties are checked by means of simulation and formally proved with a model checker.     

Energy-optimal collaborative file distribution in wired networks

The impact of the ICT sector in worldwide power consumption is an increasing concern, motivating the research community to devote an important effort to define novel energy efficient networking solutions. Despite file distribution is responsible for a major portion of the current Internet traffic, little effort has been dedicated to address the issue of its energy efficiency so far. Most of the previous literature focuses on optimizing the download time of file distribution schemes (e.g. centralized server-based or distributed peer-to-peer solutions) while it is yet unclear how to optimize file distribution schemes from the point of view of energy consumed. In this paper, we present a general modelling framework to analyze the energy consumption of file distribution systems. First, we show that the general problem of minimizing energy consumption in file distribution is NP-hard. Then, for restricted versions of the problem, we establish theoretical bounds to minimal energy consumption. Furthermore, we define a set of optimal algorithms for a variety of system settings, which exploit the service capabilities of hosts in a P2P fashion. We show that our schemes are capable of reducing at least 50 % of the energy consumed by traditional (yet largely used) centralized distribution schemes even when considering effects such as network congestion and heterogeneous access speed across nodes.     

On the performance of Dijkstra’s third self-stabilizing algorithm for mutual exclusion and related algorithms

In Dijkstra (Commun ACM 17(11):643–644, 1974) introduced the notion of self-stabilizing algorithms and presented three such algorithms for the problem of mutual exclusion on a ring of n processors. The third algorithm is the most interesting of these three but is rather non intuitive. In Dijkstra (Distrib Comput 1:5–6, 1986) a proof of its correctness was presented, but the question of determining its worst case complexity—that is, providing an upper bound on the number of moves of this algorithm until it stabilizes—remained open. In this paper we solve this question and prove an upper bound of 3\frac1318 n² + O(n){3\frac{13}{18} n^2 + O(n)} for the complexity of this algorithm. We also show a lower bound of 1\frac56 n² - O(n){1\frac{5}{6} n^2 - O(n)} for the worst case complexity. For computing the upper bound, we use two techniques: potential functions and amortized analysis. We also present a new-three state self-stabilizing algorithm for mutual exclusion and show a tight bound of \frac56 n² + O(n){\frac{5}{6} n^2 + O(n)} for the worst case complexity of this algorithm. In Beauquier and Debas (Proceedings of the second workshop on self-stabilizing systems, pp 17.1–17.13, 1995) presented a similar three-state algorithm, with an upper bound of 5\frac34n²+O(n){5\frac{3}{4}n^2+O(n)} and a lower bound of \frac18n²-O(n){\frac{1}{8}n^2-O(n)} for its stabilization time. For this algorithm we prove an upper bound of 1\frac12n² + O(n){1\frac{1}{2}n^2 + O(n)} and show a lower bound of n ²−O(n). As far as the worst case performance is considered, the algorithm in Beauquier and Debas (Proceedings of the second workshop on self-stabilizing systems, pp 17.1–17.13, 1995) is better than the one in Dijkstra (Commun ACM 17(11):643–644, 1974) and our algorithm is better than both.     

The languages FCP(:) and FCP(:,?)

The language FCP(:,?) is the outcome of attempts to integrate the best of several flat concurrent logic programming languages, including Flat GHC, FCP (↓, |) and Flat Concurrent Prolog, in a single consistent framework. FCP(:) is a subset of FCP(:, ?), which is a variant of FPP(↓, |) and employs concepts of the concurrent constraint framework of cc(↓, |). FCP(:, ?) is a language which is strong enough to accommodate all useful concurrent logic programming techniques, including those which rely on atomic test unification and read-only variables, yet incorporates the weaker languages mentioned as subsets. This allows the programmer to remain within a simple subset of the language such as Flat GHC when the full power of atomic unification or read-only variables is not needed.     

On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming

In a communication network one often needs to combine several communication requests into a path in a physical layer of the network. In these cases the cost is measured in terms of the total length of these paths or the total hardware cost of maintaining these paths. In this paper we consider a problem belonging to this general family of optimization problems. We consider the problem of minimizing the number of regenerators in optical networks with traffic grooming. In this problem we are given a network with an underlying topology of a graph G, a set of requests that correspond to paths in G and two positive integers g and d. There is a need to put a regenerator every d edges of every path, because of a degradation in the quality of the signal. Each regenerator can be shared by at most g paths, g being the grooming factor. On the one hand, we show that even in the case of d=1 the problem is APX-hard, i.e. a polynomial time approximation scheme for it does not exist (unless P=NP). On the other hand, we solve such a problem for general G and any d and g, by providing an O(logg)-approximation algorithm and thus extending previous results holding only for specific topologies and specific values of d or g.